A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
نویسندگان
چکیده
منابع مشابه
A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
This paper presents a new hybrid evolutionary algorithm to solve multi-objective multicast routing problems in telecommunication networks. The algorithm combines simulated annealing strategies and genetic local search, aiming at a more flexible and effective exploration and exploitation in the search space of the complex problem to find more non-dominated solutions in the Pareto Front. Due to t...
متن کاملSolving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods
This paper presents the investigation of an evolutionary multi-objective simulated annealing algorithm with variable neighborhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighborhood search to find more non-dominate...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملGenetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based search algorithm for cost minimisation of multicast routing. The algorithm utilises the partially mixed crossover operation (PMX) under the elitist model: for each element of the current population, the local search is...
متن کاملLocal Search Procedures in a Multi-Objective Genetic Local Search Algorithm for Scheduling Problems
We have already proposed a multi-objective genetic local search algorithm for finding nondominated solutions of multi-objective optimization problems (Ishibuchi & Murata 1998). In our hybrid algorithm, a local search procedure is applied to each solution generated by genetic operations (i.e., selection, crossover, and mutation). Since our optimization problem involves multiple objectives, the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2013
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-013-1322-7